An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing
نویسندگان
چکیده
We consider the 3-stage two-dimensional bin packing problem, which occurs in real-world problems such as glass cutting. For it, we present a new integer linear programming formulation and a branch and price algorithm. Column generation is performed by applying either a greedy heuristic or an Evolutionary Algorithm (EA). Computational experiments show the benefits of the EA-based approach. The higher computational effort of the EA pays off in terms of better final solutions; furthermore more instances can be solved to provable optimality.
منابع مشابه
Models and algorithms for three-stage two-dimensional bin packing
We consider the three-stage two-dimensional bin packing problem (2BP) which occurs in real-world applications such as glass, paper, or steel cutting. We present new integer linear programming formulations: Models for a restricted version and the original version of the problem are developed. Both involve polynomial numbers of variables and constraints only and effectively avoid symmetries. Thos...
متن کاملDiscrete Optimization ATM VP-based network design
We consider the problem of designing an ATM VP-based leased line backbone network. Given point-to-point communication demands having predefined sizes in a network, the problem is to find configurations of demand routes and link facilities installed on each edge satisfying all demands at minimum cost under some constraints. One of the most important constraints is that a single demand cannot be ...
متن کاملBranch and Price for Chance Constrained Bin Packing
This article considers two versions of the stochastic bin packing problem with chance constraints. In the first version, we formulate the problem as a two-stage stochastic integer program that considers item-tobin allocation decisions in the context of chance constraints on total item size within the bins. Next, we describe a distributionally robust formulation of the problem that assumes the i...
متن کاملUsing Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
T two-dimensional bin-packing problem is the problem of orthogonally packing a given set of rectangles into a minimum number of two-dimensional rectangular bins. The problem is -hard and very difficult to solve in practice as no good mixed integer programming (MIP) formulation has been found for the packing problem. We propose an algorithm based on the well-known Dantzig-Wolfe decomposition whe...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کامل